Operational Semantics for Reexecution-based Analysis of Logic Programs with Delay Declarations
نویسندگان
چکیده
منابع مشابه
Operational Semantics for Reexecution-based Analysis of Logic Programs with Delay Declarations
We draw concrete and abstract operational semantics towards the analysis of logic programs with delay declarations. This is the basis to generalize the abstract interpreter GAIA to deal with logic programs employing dynamic scheduling. The concrete and abstract semantics are introduced explicitly and express both deadlock information and qualified answers. Sure deadlock and sure no deadlock inf...
متن کاملReexecution-Based Analysis of Logic Programs with Delay Declarations
A general semantics-based framework for the analysis of logic programs with delay declarations is presented. The framework incorporates well known refinement techniques based on reexecution. The concrete and abstract semantics express both deadlock information and qualified answers.
متن کاملVerification of Logic Programs with Delay Declarations
Logic programs augmented with delay declarations form a higly expressive programming language in which dynamic networks of processes that communicate asynchronously by means of multiparty channels can be easily created. In this paper we study correctness these programs. In particular, we propose proof methods allowing us to deal with occur check freedom, absence of deadlock, absence of errors i...
متن کاملVeri cation of Logic Programs with Delay Declarations
Logic programs augmented with delay declarations form a higly expressive programming language in which dynamic networks of processes that communicate asynchronously by means of multiparty channels can be easily created. In this paper we study correctness these programs. In particular, we propose proof methods allowing us to deal with occur check freedom, absence of deadlock, absence of errors i...
متن کاملProving Termination of Logic Programs with Delay Declarations
In this paper we propose a method for proving termination of logic programs with delay declarations The method is based on the notion of recurrent logic program which is used to prove programs terminating with respect to an arbitrary selection rule Most importantly we use the notion of bound query as proposed by M Bezem in the de nition of cover a new notion which forms the kernel of our approa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2001
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(04)00148-3